#include <iostream>
using namespace std;

int n, m, M;
constexpr int MAXN = 100;
int dp[MAXN][MAXN];
void solve();
int main() {
    cin >> n >> m >> M;
    solve();
}

// 将j个球划分为i份
// dp[i][j] = dp[i][j - i] + dp[i - 1][j]
void solve() {
    dp[0][0] = 1;
    for (int i = 1; i <= m; i++)
        for (int j = 0; j <= n; j++) {
            if (j - i >= 0) dp[i][j] = dp[i][j - i] + dp[i - 1][j];
            else dp[i][j] = dp[i - 1][j];
        }        
}